0.00/0.01	% File    : /export/starexec/sandbox2/benchmark/theBenchmark.p
0.00/0.01	% app-encoded or not : original
0.00/0.01	% Variant    : purification_ext
0.00/0.01	% Ordering    : rpo6
0.00/0.01	% Command    : 
0.00/0.01	#!/bin/sh
0.00/0.01	
0.00/0.01	./zipperposition.native ${1:+"$1"} \
0.00/0.01	  -i tptp \
0.00/0.01	  -o tptp \
0.00/0.01	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.01	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.01	  --no-avatar \
0.00/0.01	  --ho \
0.00/0.01	  --force-ho \
0.00/0.01	  --no-ho-elim-pred-var \
0.00/0.01	  --ho-general-ext-pos \
0.00/0.01	  --no-ho-unif \
0.00/0.01	  --no-induction \
0.00/0.01	  --no-unif-pattern \
0.00/0.01	  --ord $2  \
0.00/0.01	  --simultaneous-sup false \
0.00/0.01	  --ho-purify ext \
0.00/0.01	  --ho-ext-axiom \
0.00/0.01	  --restrict-hidden-sup-at-vars \
0.00/0.01	  --ho-prim-enum none \
0.00/0.01	  --no-max-vars \
0.00/0.01	  --dont-select-ho-var-lits \
0.00/0.01	  --no-fool
0.00/0.20	% Computer   : n072.star.cs.uiowa.edu
0.00/0.20	% Model      : x86_64 x86_64
0.00/0.20	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.20	% Memory     : 32218.625MB
0.00/0.20	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.20	% CPULimit   : 300
0.00/0.20	% DateTime   : Fri Feb  2 18:26:54 CST 2018
0.00/0.22	% done 27 iterations in 0.018s
0.00/0.22	% SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
0.00/0.22	% SZS output start Refutation
0.00/0.22	tff('thm/sets/IN_UNIV_', axiom,
0.00/0.22	  (![A:$tType,A0:A]: 'const/sets/IN'(A,A0,'const/sets/UNIV'(A)))).
0.00/0.22	tff('0', plain,
0.00/0.22	    ![X0 : $tType, X1 : X0]: 'const/sets/IN'(X0, X1, 'const/sets/UNIV'(X0)),
0.00/0.22	    inference('cnf', [status(esa)], [thm/sets/IN_UNIV_])).
0.00/0.22	tff('thm/sets/IN_', axiom,
0.00/0.22	  (![A:$tType,P:(A > $o),A0:A]: ('const/sets/IN'(A,A0,P) <=> P(A0)))).
0.00/0.22	tff('1', plain,
0.00/0.22	    ![X2 : $tType, X3 : X2 > $o, X4 : X2]:
0.00/0.22	      (X3(X4) | ~ 'const/sets/IN'(X2, X4, X3)),
0.00/0.22	    inference('cnf', [status(esa)], [thm/sets/IN_])).
0.00/0.22	tff('2', plain,
0.00/0.22	    ![X2 : $tType, X3 : X2 > $o, X4 : X2, X5 : X2 > $o]:
0.00/0.22	      (X5 != X3 | X3(X4) | ~ 'const/sets/IN'(X2, X4, X5)),
0.00/0.22	    inference('ho.purify_applied_variable', [status(thm)], ['1'])).
0.00/0.22	tff('3', plain,
0.00/0.22	    ![X0 : $tType, X1 : X0, X2 : X0 > $o]:
0.00/0.22	      (~ $true | X2(X1) | 'const/sets/UNIV'(X0) != X2),
0.00/0.22	    inference('sup-', [status(thm)], ['0', '2'])).
0.00/0.22	tff('4', plain,
0.00/0.22	    ![X0 : $tType, X1 : X0, X2 : X0 > $o]:
0.00/0.22	      ('const/sets/UNIV'(X0) != X2 | X2(X1)),
0.00/0.22	    inference('simplify', [status(thm)], ['3'])).
0.00/0.22	tff('5', plain,
0.00/0.22	    ![X0 : $tType, X1 : X0, X2 : X0 > $o, X3 : X0 > $o]:
0.00/0.22	      (X3 != X2 | 'const/sets/UNIV'(X0) != X2 | X3(X1)),
0.00/0.22	    inference('ho.purify_applied_variable', [status(thm)], ['4'])).
0.00/0.22	tff('thm/sets/IN_UNION_', axiom,
0.00/0.22	  (![A:$tType,A0:(A > $o),A1:(A > $o),A2:A]:
0.00/0.22	     ('const/sets/IN'(A,A2,'const/sets/UNION'(A,A0,A1)) <=>
0.00/0.22	      ('const/sets/IN'(A,A2,A1) | 'const/sets/IN'(A,A2,A0))))).
0.00/0.22	tff('6', plain,
0.00/0.22	    ![X6 : $tType, X8 : X6 > $o, X9 : X6 > $o, X10 : X6]:
0.00/0.22	      ('const/sets/IN'(X6, X10, 'const/sets/UNION'(X6, X8, X9))
0.00/0.22	       | ~ 'const/sets/IN'(X6, X10, X9)),
0.00/0.22	    inference('cnf', [status(esa)], [thm/sets/IN_UNION_])).
0.00/0.22	tff('thm/sets/UNION_UNIV_1', conjecture,
0.00/0.22	  (![A:$tType,A0:(A > $o)]:
0.00/0.22	     ('const/sets/UNION'(A,A0,'const/sets/UNIV'(A)) = 'const/sets/UNIV'(A)))).
0.00/0.22	tff(zf_stmt_0, negated_conjecture,
0.00/0.22	  (~
0.00/0.22	    (![A:$tType,A0:(A > $o)]:
0.00/0.22	       ('const/sets/UNION'(A,A0,'const/sets/UNIV'(A)) = 'const/sets/UNIV'(A))))).
0.00/0.22	tff('7', plain,
0.00/0.22	    'const/sets/UNION'(sk_A, sk_A0, 'const/sets/UNIV'(sk_A))
0.00/0.22	     != 'const/sets/UNIV'(sk_A),
0.00/0.22	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.22	tff('8', plain,
0.00/0.22	    'const/sets/UNION'(sk_A, sk_A0, 'const/sets/UNIV'(sk_A), '#k1')
0.00/0.22	     != 'const/sets/UNIV'(sk_A, '#k1'),
0.00/0.22	    inference('rw_lit', [status(thm)], ['7'])).
0.00/0.22	tff('9', plain,
0.00/0.22	    ![X0 : sk_A > $o]:
0.00/0.22	      ($true != 'const/sets/UNIV'(sk_A, '#k1')
0.00/0.22	       | ~ 'const/sets/IN'(sk_A, '#k1', X0)
0.00/0.22	       | X0 != 'const/sets/UNION'(sk_A, sk_A0, 'const/sets/UNIV'(sk_A))),
0.00/0.22	    inference('sup-', [status(thm)], ['2', '8'])).
0.00/0.22	tff('10', plain,
0.00/0.22	    (~ 'const/sets/IN'(sk_A, '#k1', 
0.00/0.22	         'const/sets/UNION'(sk_A, sk_A0, 'const/sets/UNIV'(sk_A)))
0.00/0.22	     | ~ 'const/sets/UNIV'(sk_A, '#k1')),
0.00/0.22	    inference('eq_res', [status(thm)], ['9'])).
0.00/0.22	tff('11', plain,
0.00/0.22	    (~ $true
0.00/0.22	     | ~ 'const/sets/IN'(sk_A, '#k1', 'const/sets/UNIV'(sk_A))
0.00/0.22	     | ~ 'const/sets/UNIV'(sk_A, '#k1')),
0.00/0.22	    inference('sup-', [status(thm)], ['6', '10'])).
0.00/0.22	tff('12', plain, (~ $true | ~ $true | ~ 'const/sets/UNIV'(sk_A, '#k1')),
0.00/0.22	    inference('demod', [status(thm)], ['11', '0'])).
0.00/0.22	tff('13', plain, ~ 'const/sets/UNIV'(sk_A, '#k1'),
0.00/0.22	    inference('simplify', [status(thm)], ['12'])).
0.00/0.22	tff('14', plain,
0.00/0.22	    ![X0 : sk_A > $o]:
0.00/0.22	      (~ $true
0.00/0.22	       | 'const/sets/UNIV'(sk_A) != X0
0.00/0.22	       | 'const/sets/UNIV'(sk_A) != X0),
0.00/0.22	    inference('sup-', [status(thm)], ['5', '13'])).
0.00/0.22	tff('15', plain, ![X0 : sk_A > $o]: 'const/sets/UNIV'(sk_A) != X0,
0.00/0.22	    inference('simplify', [status(thm)], ['14'])).
0.00/0.22	tff('16', plain, $false, inference('eq_res', [status(thm)], ['15'])).
0.00/0.22	
0.00/0.22	% SZS output end Refutation
0.00/0.22	EOF
